翻訳と辞書 Words near each other ・ Edmondson Avenue Historic District ・ Edmondson Hall ・ Edmondson Junior College ・ Edmondson Park railway station ・ Edmondson Park, New South Wales ・ Edmondson railway ticket ・ Edmondson, Arkansas ・ Edmondson, Baltimore ・ Edmondson-Westside High School ・ Edmondson-Woodward House ・ Edmondston ・ Edmondston-Alston House ・ Edmondstown ・ Edmonds–Karp algorithm ・ Edmonds–Kingston Ferry ・ Edmonds–Pruhs protocol ・ Edmondthorpe ・ Edmondthorpe and Wymondham railway station ・ Edmonia Henderson ・ Edmonia Lewis ・ Edmonson ・ Edmonson County High School ・ Edmonson County, Kentucky ・ Edmonson News ・ Edmonson Point ・ Edmonson sisters ・ Edmonson v. Leesville Concrete Co. ・ Edmonson, Missouri ・ Edmonson, Texas ・ Edmonston Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Edmonds–Pruhs protocol ： ウィキペディア英語版 Edmonds–Pruhs protocol Edmonds–Pruhs protocol is a protocol for fair cake-cutting. Its goal is to create a partially proportional division of a heterogeneous resource among ''n'' people, such that each person receives a subset of the cake which that person values as at least 1/''an'' of the total, where ''a>1'' is a constant. It is a randomized algorithm whose running time is O(''n'') with probability close to 1. The protocol was developed by Jeff Edmonds and Kirk Pruhs, who later improved it in joint work with Jaisingh Solanki. == Motivation == A proportional division of a cake can be achieved using the recursive halving algorithm in time O(''n'' log ''n''). Several hardness results show that this run-time is optimal under a wide variety of assumptions. In particular, recursive halving is the fastest possible algorithm for achieving full proportionality when the pieces must be contiguous, and it is the fastest possible deterministic algorithm for achieving even partial proportionality and even when the pieces are allowed to be disconnected. One case which is not covered by the hardness results is the case of ''randomized algorithms'', guaranteeing only ''partial proportionality'' and with ''possibly disconnected pieces''. The Edmonds–Pruhs protocol aims to provide an algorithm with run-time O(''n'') for this case. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Edmonds–Pruhs protocol」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.